A Note on the Complexity of Associative-Commutative Lambek Calculus
نویسنده
چکیده
In this paper the NP-completeness of the system LP (associative-commutative Lambek calculus) will be shown. The complexity of LP has been known for some time, it is a corollary of a result for multiplicative intuitionistic linear logic (MILL)1 from (Kanovich, 1991) and (Kanovich, 1992). We show that this result can be strengthened: LP remains NP-complete under certain restrictions. The proof does not depend on results from the area of linear logic, it is based on a simple linear-time reduction from the minimum node-cover problem to recognizing sentences in LP.
منابع مشابه
Rigid grammars in the Associative-Commutative Lambek Calculus are not learnable
In (Kanazawa, 1998) it was shown that rigid Classical Categorial Grammars are learnable (in the sense of (Gold, 1967)) from strings. Surprisingly there are recent negative results for, among others, rigid associative Lamb ek (L) grammars. In this paper the non-lcarnability of the class of rigid grammars in LP (Associative-Commutative Lambek calculus) and LP0 (same, but allowing the empty sequen...
متن کاملThe Non-Associative Lambek Calculus with Product in Polynomial Time
We prove, by introducing a new kind of sequent calculus, that the decision problem for the non-associative Lambek calculus with product belongs to PTIME. This solves an open prolem.
متن کاملLambek Calculus with Nonlogical Axioms
We study Nonassociative Lambek Calculus and Associative Lambek Calculus enriched with finitely many nonlogical axioms. We prove that the nonassociative systems are decidable in polynomial time and generate context-free languages. In [Buszkowski 1982] it has been shown that finite axiomatic extensions of Associative Lambek Calculus generate all recursively enumerable languages; here we give a ne...
متن کاملThe Lambek-Grishin Calculus Is NP-Complete
The Lambek-Grishin calculus LG is the symmetric extension of the non-associative Lambek calculus NL. In this paper we prove that the derivability problem for LG is NP-complete.
متن کاملPolarized Montagovian Semantics for the Lambek-Grishin Calculus
Grishin ([9]) proposed enriching the Lambek calculus with multiplicative disjunction (par) and coresiduals. Applications to linguistics were discussed by Moortgat ([14]), who spoke of the Lambek-Grishin calculus (LG). In this paper, we adapt Girard’s polarity-sensitive double negation embedding for classical logic ([7]) to extract a compositional Montagovian semantics from a display calculus fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002